Lecture 5 — March 1 , 2012
نویسندگان
چکیده
In the next two lectures we study the question of dynamic optimality, or whether there exists a binary search tree algorithm that performs ”as well” as all other algorithms on any input string. In this lecture we will define a binary search tree as a formal model of computation, show some analytic bounds that a dynamically optimal binary search tree needs to satisfy, and show two search trees that are conjectured to be dynamically optimal. The first is the splay tree, which we will cover only briefly. The second will require us to build up a geometric view of a sequence of binary search tree queries.
منابع مشابه
A Very Long Lecture on the Physical Approach to Donaldson and Seiberg-Witten Invariants of Four-Manifolds
These are lecture notes for a lecture at the Simons Center for Geometry and Physics School on Mathematical Applications of Supersymmetric Yang Mills Theory, March 8, 2012
متن کاملMath 140a: Foundations of Real Analysis I
1. Ordered Sets, Ordered Fields, and Completeness 1 1.1. Lecture 1: January 5, 2016 1 1.2. Lecture 2: January 7, 2016 4 1.3. Lecture 3: January 11, 2016 7 1.4. Lecture 4: January 14, 2014 9 2. Sequences and Limits 13 2.1. Lecture 5: January 19, 2016 13 2.2. Lecture 6: January 21, 2016 15 2.3. Lecture 7: January 26, 2016 18 2.4. Lecture 8: January 28, 2016 21 3. Extensions of R: the Extended Rea...
متن کاملLecture 16 - March 22 , 2012
In the last lecture we talked about how to support dynamic graphs with respect to operations which included insertion and deletion of edges and looking for existence of path between two vertices. In this lecture we will talk about supporting all pair shortest paths along with addition, deletion and updation of edges in O(n2 log n) amortized time on the graphs with non negative real-valued edge ...
متن کاملLecture 10 — March 20 , 2012
In the last lecture, we finished up talking about memory hierarchies and linked cache-oblivious data structures with geometric data structures. In this lecture we talk about different approaches to hashing. First, we talk about different hash functions and their properties, from basic universality to k-wise independence to a simple but effective hash function called simple tabulation. Then, we ...
متن کاملExpression of concern.
References 1. http://abnormalscienceblog.wordpress.com/2011/11/27/matsubara-lab-in-japan-breathtaking-reuse-ofwestern-and-northern-blot-bands/#more-1026. Accessed March 5, 2012. 2. http://abnormalscienceblog.wordpress.com/2011/11/30/matsubara-lab-in-japan-breathtaking-reuse-ofhistological-images-and-fragments-part-2/. Accessed March 5, 2012. 3. http://abnormalscienceblog.wordpress.com/2011/12/1...
متن کامل